PICKUP AND DELIVERY WITH TIME WINDOWS: ALGORITHMS AND TEST CASE GENERATION
نویسندگان
چکیده
منابع مشابه
Pickup and Delivery with Time Windows: Algorithms and Test Case Generation
In the pickup and delivery problem with time windows (PDPTW), vehicles have to transport loads from origins to destinations respecting capacity and time constraints. In this paper, we present a two-phase method to solve the PDPTW. In the first phase, we apply a novel construction heuris tics to generate an initial solution. In the second phase, a tabu search method is proposed to improve the so...
متن کاملModels and branch-and-cut algorithms for pickup and delivery problems with time windows
In the pickup and delivery problem with time windows (PDPTW), capacitated vehicles must be routed to satisfy a set of transportation requests between given origins and destinations. In addition to capacity and time window constraints, vehicle routes must also satisfy pairing and precedence constraints on pickups and deliveries. This paper introduces two new formulations for the PDPTW and the cl...
متن کاملComparing Genetic Algorithms and Simulated Annealing for Solving the Pickup and Delivery Problem with Time Windows
Solving the Vehicle Routing Problem (VRP) and its related variants is significant for optimizing logistic planning. One important variant of the VRP is the Pickup and Delivery Problem with Time Windows (PDPTW), where it is assumed that a client may request one of two service types, a pickup or a delivery. It is required to find a set of minimum cost routes for a fleet of vehicles, while observi...
متن کاملInvestigating Genetic Algorithms for Solving the Multiple Vehicle Pickup and Delivery Problem with Time Windows
One important problem in transportation and logistics systems is the Multiple Vehicle Pickup and Delivery Problem with Time Windows (MV-PDPTW). The problem deals with a number of pickup and delivery (P&D) requests that should be served by a fleet of vehicles. A delivery location must be served after its corresponding pickup location. The vehicle’s journey should start and end at a central depot...
متن کاملBranch and Cut and Price for the Pickup and Delivery Problem with Time Windows
In the pickup and delivery problem with time windows (PDPTW), vehicle routes must be designed to satisfy a set of transportation requests, each involving a pickup and a delivery location, under capacity, time window, and precedence constraints. This paper introduces a new branch-and-cut-and-price algorithm in which lower bounds are computed by solving through column generation the linear progra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal on Artificial Intelligence Tools
سال: 2002
ISSN: 0218-2130,1793-6349
DOI: 10.1142/s0218213002000988